On Automorphisms of Markov Chains
نویسندگان
چکیده
منابع مشابه
On Automorphisms of Markov Chains
We prove several theorems about automorphisms of Markov chains, using the weight-per-symbol polytope. Introduction The main purpose of this paper is to show how the weight-per-symbol polytope (WPS), introduced in [MT1, §3] can be used in the study of automorphisms (i.e., measure-preserving conjugacies) of Markov chains, in particular, with regard to the question of which permutations of finitel...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملOn Triplet Markov Chains
The restoration of a hidden process X from an observed process Y is often performed in the framework of hidden Markov chains (HMC). HMC have been recently generalized to triplet Markov chains (TMC). In the TMC model one introduces a third random chain U and assumes that the triplet T = (X,U, Y ) is a Markov chain (MC). TMC generalize HMC but still enable the development of efficient Bayesian al...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملOn Mixtures of Markov Chains
We study the problem of reconstructing a mixture of Markov chains from the trajectories generated by random walks through the state space. Under mild nondegeneracy conditions, we show that we can uniquely reconstruct the underlying chains by only considering trajectories of length three, which represent triples of states. Our algorithm is spectral in nature, and is easy to implement.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1992
ISSN: 0002-9947
DOI: 10.2307/2154048